<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: Member List</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>bfs Member List</h1>This is the complete list of members for <a class="el" href="a00003.html">bfs</a>, including all inherited members.<p><table>
  <tr class="memlist"><td><a class="el" href="a00003.html#5a4adad9562896536b8b58ab237e8478">act_bfs_num</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#b79e1ddec2f2afdf4b36b10724db8b15">algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#7b83a88f71f210946be3ef212f4c2c37">begin</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#a47a4c97f240c4745c9890524e746bf4">bfs</a>()</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#cafce54954100cc7bc9f80eb318a7bee">bfs_iterator</a> typedef</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#ad3b67493e3d936f8ca3d1fe38d72842">bfs_num</a>(const node &amp;n) const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#59d0c5c5ad2715776b20b1aec03dbc3a">bfs_number</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#35b0acd44887615142fd5f2fc6197452">bfs_order</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#491515da4eb8efca0be4fef0df350a8e">calc_level</a>(bool set)</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#8a67bff3ab12226cf8f4bea4a14bd183">calc_level</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#6dd7e852f7768814aafba8962befca56">check</a>(graph &amp;G)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#b1a9a095e1e757e8f71ba752bf0e898d">end</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#d99b9aeb177a8a2e0ce1c3673082cddf">end_handler</a>(graph &amp;G)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#eff99e4f0142cbb9977503844c0d45c9">father</a>(const node &amp;n) const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#db6604080f3376e9713e35cd9d7d8943">finished_node_handler</a>(graph &amp;G, node &amp;n)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">GTL_ERROR</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">GTL_OK</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#b9af608a9b2d570a8688498bc3c53d7f">init_handler</a>(graph &amp;G)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#db141187b9b6c9fc78089eb87ba19ad4">level</a>(const node &amp;n) const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#ab92e9d128612c28324aafe4750dbc84">level_number</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#4f33f10121240390a5a50b5efc16c1f5">new_start_handler</a>(graph &amp;G, node &amp;n)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#a6783e3e2ac4235403b37df3ee3ee968">non_tree</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#0c7c3cb97a538907ddd0dc39bd884ffc">non_tree_edges_begin</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#37645ce2ffc6fb95afb56477025a64a8">non_tree_edges_end</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#ecd86c7c1f1086d4b6b11c2a0eb12afe">non_tree_edges_iterator</a> typedef</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#50ca0ee41753b59ed7adfe9f60adf1e4">number_of_reached_nodes</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#01e0e18c3478faf9ea6b9140c1cc4102">operator[]</a>(const node &amp;n) const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#3f161fe9f45e0a69892f355a889c3516">popped_node_handler</a>(graph &amp;G, node &amp;n)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#3bac5ed333bb78a30a67099c3b94aa0c">preds</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#ff965242124a7e3a6308de0c0ebfa741">qu</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#a91531970fa0eb1c7e18d5455f54fe9f">reached</a>(const node &amp;n) const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#c3db80b59d5db049199936445a6c2da8">reached_nodes</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#355b797efe46ab262e71c05ba75de940">reset</a>()</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#79d19028002766f7992fe94689217f99">roots</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#ae9df31655e7ef516426dfb99c2de888">roots_begin</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#31e77fd48aed1902d488a54f2f0ef6f8">roots_end</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#386ac6f3c63e38c3f5263e15c3ab9d01">roots_iterator</a> typedef</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#06ae16bd0f3bb2f8eb6b3e36659ba82e">run</a>(graph &amp;G)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#25fc51b1bfbbdd3afefe0a84c1bd2f6b">scan_whole_graph</a>(bool set)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#d698825ec64edfa808210de913a922d3">scan_whole_graph</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#f2ab561d9e60a9fc2e25b02d1f807f96">start</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#23e2981c2ee617a6e12a8833d2db6210">start_node</a>(const node &amp;n)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#c5cf27683ad751cd6e4129141fc9b495">start_node</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#7de47b820fb9532f497660f767c9457f">store_non_tree_edges</a>(bool set)</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#9e16858479ee2b4980b4dbe73202a9d6">store_non_tree_edges</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#8c7ce0ea2cd8e1932d1da5693d90cf61">store_preds</a>(bool set)</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#1b73eb7f1fb984331781da890bd45029">store_preds</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#a259f09ada9928cda41bcb540f685e80">tree</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#50fbe73f807b39845bb2334548c9b8cb">tree_edges_begin</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#609773f0e8e94dbdd330d5363c6d610c">tree_edges_end</a>() const </td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#a0b58a03ca2fc32117948ab27a806bd1">tree_edges_iterator</a> typedef</td><td><a class="el" href="a00003.html">bfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#0e45c8fe90e54bffe18b308868ccc111">unused_node_handler</a>(graph &amp;G, node &amp;n, node &amp;f)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#d2cbb1e9c36f561da0c91fd142296f2a">used_node_handler</a>(graph &amp;G, node &amp;n, node &amp;f)</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#6c08fbcc90d71f1cbdd03a1cdaa9dc99">whole_graph</a></td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#dca9b1e7fa3afd914519a9dbb44e9fd5">~algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00003.html#e38bc9acd4cf02a748886f2fc0d88557">~bfs</a>()</td><td><a class="el" href="a00003.html">bfs</a></td><td><code> [virtual]</code></td></tr>
</table>    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>
